Automata with Finite Congruence Lattices
نویسنده
چکیده
In this paper we prove that if the congruence lattice of an automaton A is finite then the endomorphism semigroup E(A) of A is finite. Moreover, if A is commutative then A is A-finite. We prove that if 3 ≤ |A| then a commutative automaton A is simple if and only if it is a cyclic permutation automaton of prime order. We also give some results concerning cyclic, strongly connected and strongly trap-connected automata.
منابع مشابه
Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملCongruence-preserving Extensions of Finite Lattices to Semimodular Lattices
We prove that every finite lattice has a congruence-preserving extension to a finite semimodular lattice.
متن کاملCongruence Lattices of Finite Semimodular Lattices
We prove that every finite distributive lattice can be represented as the congruence lattice of a finite (planar) semimodular lattice.
متن کاملCongruence Lattices of Congruence Semidistributive Algebras
Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finite semilattices seemed too hard for us, so we went on to other things. Thus when Steve Seif asked one of us at the October 1990 meeting of the AMS in Amherst what we had learned in the meantime, the answer was...
متن کاملCongruence-preserving Extensions of Finite Lattices to Isoform Lattices
We call a lattice L isoform, if for any congruence relation Θ of L, all congruence classes of Θ are isomorphic sublattices. In an earlier paper, we proved that for every finite distributive lattice D, there exists a finite isoform lattice L such that the congruence lattice of L is isomorphic to D. In this paper, we prove a much stronger result: Every finite lattice has a congruence-preserving e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Acta Cybern.
دوره 18 شماره
صفحات -
تاریخ انتشار 2007